Characterization of self-complementary graphs with 2-factors
نویسنده
چکیده
Let G be a self-complementary graph (w.) and ir its degree sbquence. Th ;n G has a 2-factor if and only if R 2 is graphic. This is achieved by ohtaming a structure theorem regarding S.C. graphs without a Z-factor. Another irrreresting corollary of the structure theorem is that if G is a s c. graph of order p 3 N with minimum degree at least p/4, then G has a ?-factor and the result is the best poss~blc.
منابع مشابه
Homogeneously almost self-complementary graphs
A graph is called almost self-complementary if it is isomorphic to the graph obtained from its complement by removing a 1-factor. In this paper, we study a special class of vertex-transitive almost self-complementary graphs called homogeneously almost selfcomplementary. These graphs occur as factors of symmetric index-2 homogeneous factorizations of the “cocktail party graphs” K2n − nK2. We con...
متن کاملOn Self-complementary Chordal Graphs Defined by Single Forbidden Induced Subgraph
In this paper we deal with several subclasses of self complementary chordal graphs characterized by single forbidden induced subgraph namely Chairfree sc chordal graphs, H-free sc chordal graphs and Cross (star1, 1, 1, 2)-free sc chordal graphs. We obtain some results on these classes and an algorithm is proposed based on these results that recognize these classes. We also compile a catalogue o...
متن کاملClique-Width for Graph Classes Closed under Complementation
Clique-width is an important graph parameter due to its algorithmic and structural properties. A graph class is hereditary if it can be characterized by a (not necessarily finite) set H of forbidden induced subgraphs. We initiate a systematic study into the boundedness of clique-width of hereditary graph classes closed under complementation. First, we extend the known classification for the |H|...
متن کاملTwo-graphs, Double Covers over Complete Graphs, and Almost Self-complementary Graphs
A graph X is called almost self-complementary with respect to a perfect matching I in the complement Xc if it is isomorphic to the graph obtained from Xc by removing the edges of I. In this paper we investigate the relationship between self-complementary two-graphs and double covers over complete graphs that are almost self-complementary with respect to their set of fibres. In particular, we cl...
متن کاملEuropean Journal of Combinatorics
A graph X is called almost self-complementary with respect to a perfect matching I if it is isomorphic to the graph obtained from its complement Xc by removing the edges of I. A two-graph on a vertex set Ω is a collection T of 3-subsets of Ω such that each 4-subset of Ω contains an even number of elements of T . In this paper we investigate the relationship between self-complementary two-graphs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete Mathematics
دوره 17 شماره
صفحات -
تاریخ انتشار 1977